A note on multigrid preconditioning for fractional PDE-constrained optimization problems

نویسندگان

چکیده

In this note we present a multigrid preconditioning method for solving quadratic optimization problems constrained by fractional diffusion equation. Multigrid methods within the all-at-once approach to solve first order optimality Karush–Kuhn–Tucker (KKT) systems are widely popular, but their development have relied on underlying being sparse. On other hand, most discretizations, matrix representation of operators is expected be dense. We develop strategy our problem based reduced approach, namely eliminate state constraint using control-to-state map. Our shows dramatic reduction in number CG iterations. assess quality preconditioner terms spectral distance. Finally, provide partial theoretical analysis preconditioner, and formulate conjecture which clearly supported numerical experiments.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multigrid One-Shot Method for PDE-Constrained Optimization Problems

This paper presents a numerical method for PDE-constrained optimization problems. These problems arise in many fields of science and engineering including those dealing with real applications. The physical problem is modeled by partial differential equations (PDEs) and involve optimization of some quantity. The PDEs are in most cases nonlinear and solved using numerical methods. Since such nume...

متن کامل

A preconditioning technique for a class of PDE-constrained optimization problems

We investigate the use of a preconditioning technique for solving linear systems of saddle point type arising from the application of an inexact Gauss–Newton scheme to PDE-constrained optimization problems with a hyperbolic constraint. The preconditioner is of block triangular form and involves diagonal perturbations of the (approximate) Hessian to insure nonsingularity and an approximate Schur...

متن کامل

Constrained Programming for Optimization Problems in PDE

Optimization problems in PDE models are often approached by considering the PDE model as a black-box input-output relation and thus solving an unconstrained optimization problem. In contrast to that, considering the PDE model as a side condition of a resulting constrained programming problem enables us to simultaneously solve the PDE model equations together with the optimization problem. This ...

متن کامل

Multigrid Methods for PDE Optimization

Research on multigrid methods for optimization problems is reviewed. Optimization problems include shape design, parameter optimization, and optimal control problems governed by partial differential equations of elliptic, parabolic, and hyperbolic type.

متن کامل

Nonlinear Preconditioning Techniques for Full-Space Lagrange-Newton Solution of PDE-Constrained Optimization Problems

The full-space Lagrange–Newton algorithm is one of the numerical algorithms for solving problems arising from optimization problems constrained by nonlinear partial differential equations. Newton-type methods enjoy fast convergence when the nonlinearity in the system is well-balanced; however, for some problems, such as the control of incompressible flows, even linear convergence is difficult t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Results in applied mathematics

سال: 2021

ISSN: ['2590-0374', '2590-0382']

DOI: https://doi.org/10.1016/j.rinam.2020.100133